Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals
نویسندگان
چکیده
We consider virtual circuit packet switching communication networks that employ processor sharing type service disciplines and study their stability when the ooered traac to the network has exponentially bounded burstiness (EBB). The advantages of processor sharing switching techniques both in terms of service exibility and the potential capability to guarantee certain grades of service, were emphasized in 7]. The study presented there assumes that the traac ooered to the network is ow-controlled by the leaky-bucket mechanism, and the performance of both generalized processor sharing (GPS) and packet-by-packet generalized processor sharing (PGPS) is analyzed. In this paper we employ an exponential characterization (EBB) introduced in 11] to analyze this type of systems in a stochastic setting. We rst examine the GPS and PGPS servers in isolation, and demonstrate their superiority to a general server in the stochastic environment. We then show that a network of servers, that are all either GPS or PGPS, is stable whenever the service rate of each node is larger than the total arrival rate to it. In addition, we provide exponential upper bounds to the traac ows within the network links, and to the backlogs of each session in the various nodes on its path.
منابع مشابه
Statistical Analysis of the Generalized ProcessorSharing Scheduling
|In this paper, we develop bounds on the individual session backlog and delay distribution under the Generalized Processor Sharing (GPS) scheduling discipline. This work is motivated by, and is an extension of, Parekh and Gal-lager's deterministic study of the GPS scheduling discipline with leaky-bucket token controlled sessions 15], 16]. Using the exponentially bounded burstiness (E.B.B.) proc...
متن کاملCentrum Voor Wiskunde En Informatica Induced Burstiness in Generalized Processor Sharing Queues with Long-tailed Traffic Flows Induced Burstiness in Generalized Processor Sharing Queues with Long-tailed Traac Flows
We analyze the queueing behavior of long-tailed traac ows under the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing, play a major role in achieving diierentiated quality-of-service in integrated-services networks. We prove that, in certain scenarios, a ow may be strongly aaected by the activity of`heavier'-tailed ows, and may inher...
متن کاملRAPPORT Induced Burstiness in Generalized Processor Sharing Queues with Long - Tailed Traffic Flows
We analyze the queueing behavior of long-tailed traac ows under the Generalized Processor Sharing GPS discipline. GPS-based scheduling algorithms, such a s W eighted Fair Queueing, play a major role in achieving diierentiated quality-of-service in integrated-services networks. We prove that, in certain scenarios, a ow m a y be strongly aaected by the activity of`heavier'-tailed ows, and may inh...
متن کاملFast symbolic computation of the worst-case delay in tandem networks and applications
Computing deterministic performance guarantees is a defining issue for systems with hard realtime constraints, like reactive embedded systems. In this paper, we use burst-rate constrained arrivals and ratelatency servers to deduce tight worst-case delay bounds in tandem networks under arbitrary multiplexing. We present a constructive method for computing the exact worst-case delay, which we pro...
متن کاملGeneralized Guaranteed Rate Scheduling Algorithms: A Framework - Networking, IEEE/ACM Transactions on
In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a flow. We define work-conserving generalized Virtual Clock, Packet-byPacket Generalized Processor Sharing, and Self-Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow. We also define sched...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. High Speed Networks
دوره 3 شماره
صفحات -
تاریخ انتشار 1994